Variations on an Ordering Theme with Constraints

نویسندگان

  • Walter Guttmann
  • Markus Maucher
چکیده

We investigate the problem of finding a total order of a finite set that satisfies various local ordering constraints. Depending on the admitted constraints, we provide an efficient algorithm or prove NP-completeness. We discuss several generalisations and systematically classify the problems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mathematical Optimization Model for Solving Minimum Ordering Problem with Constraint Analysis and some Generalizations

In this paper, a mathematical method is proposed to formulate a generalized ordering problem. This model is formed as a linear optimization model in which some variables are binary. The constraints of the problem have been analyzed with the emphasis on the assessment of their importance in the formulation. On the one hand, these constraints enforce conditions on an arbitrary subgraph and then g...

متن کامل

Unveiling constraints to cassava production in Cambodia: An analysis from farmers’ yield variations

Cassava (Manihot esculenta Crantz) is currently the most important upland crop of Cambodia, but information on yield variations and causal factors which is important for efficiently targeting efforts to increase production is still lacking. The objectives of this study were to determine the yield variations and causal factors for cassava production in Kampong Cham province in Cambodia. Fort...

متن کامل

An Integrated Model of Project Scheduling and Material Ordering: A Hybrid Simulated Annealing and Genetic Algorithm

This study aims to deal with a more realistic combined problem of project scheduling and material ordering. The goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. The problem is first mathematically modelled. Then a hybrid simulated annealing and genetic algorithm is...

متن کامل

A revisit of a mathematical model for solving fully fuzzy linear programming problem with trapezoidal fuzzy numbers

In this paper fully fuzzy linear programming (FFLP) problem with both equality and inequality constraints is considered where all the parameters and decision variables are represented by non-negative trapezoidal fuzzy numbers. According to the current approach, the FFLP problem with equality constraints first is converted into a multi–objective linear programming (MOLP) problem with crisp const...

متن کامل

OPTIMIZATION OF MULTI PERIOD - MULTI LOCATION CONSTRUCTION PROJECTS CONSIDERING RESOURCE POOL AND BATCH ORDERING

During the past two decades, some industries have been moving towards project-centered systems in many modern countries. Therefore, managing simultaneous projects with considering the limitations in resources, equipment and manpower is very crucial. In the real world, project-based organizations are always facing with two main important features. First, the construction projects are decentraliz...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006